Distance-transitive Representations of Groups G with PSL2(q) ⊴ G ⩽ PΓL2(q)
نویسندگان
چکیده
منابع مشابه
Isoclinic Classification of Some Pairs $(G,G\')$ of $p$-Groups
The equivalence relation isoclinism partitions the class of all pairs of groups into families. In this paper, a complete classification of the set of all pairs $(G,G')$ is established, whenever $G$ is a $p$-group of order at most $p^5$ and $p$ is a prime number greater than 3. Moreover, the classification of pairs $(H,H')$ for extra special $p$-groups $H$ is also given.
متن کاملThe Primitive Distance-Transitive Representations of the Fischer Groups
Research partly funded by the DFG (Germany) in the framework of the joint research project \Algorithmic Number Theory and Algebra", and also by the European Community HCM grant in \Computational Group Theory". We classify the primitive distance-transitive representations of the Fischer sporadic simple groups and their automorphism groups. It turns out that the only primitive distance-transitive...
متن کاملAffine Distance-transitive Groups
A fruitful way of studying groups is by means of their actions on graphs. A very special and interesting class of groups are the ones acting distance-transitively on some graph. A group G acting on a connected graph F = (VT, ET) is said to act distance-transitively if its action on each of the sets {(x, y)\ x, y e VT, d(x, y) = i} is transitive. Here VT and ET stand for the vertices and edges o...
متن کاملTwo-wavelet constants for square integrable representations of G/H
In this paper we introduce two-wavelet constants for square integrable representations of homogeneous spaces. We establish the orthogonality relations fo...
متن کاملOn transitive orientations of G-e
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability graph G = (V, E) and an arbitrary edge ê ∈ E we explore the question whether the graph G − ê, obtained by removing the undirected edge ê, is a comparability graph as well. We define a new substructure of implication classes and present a complete mathematical characterization of all those edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1990
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(13)80137-0